On the Reliability Function of Variable-Rate Slepian-Wolf Coding

On the Reliability Function of Variable-Rate Slepian-Wolf Coding

The reliability function of variable-rate Slepian-Wolf coding is linked to the reliability function of channel coding with constant composition codes, through which computable lower and upper bounds are derived. The bounds coincide at rates close to the Slepian-Wolf limit, yielding a complete characterization of the reliability function in that rate regime. It is shown that variable-rate Slepia...

On the redundancy of Slepian--Wolf coding

In this paper, the redundancy of both variable and fixed rate Slepian–Wolf coding is considered. Given any jointly memoryless source-side information pair with finite alphabet, the redundancy of variable rate Slepian–Wolf coding of  with decoder only side information depends on both the block length and the decoding block error probability , and is defined as the difference between the minimum...

Analysis of Slepian Wolf Coding

Universal Incremental Slepian-Wolf Coding

We present a strategy for Slepian-Wolf coding when the joint distribution of the sources is unknown. The encoders use an incremental transmission policy, and the decoder a universal sequential decision test. We show that the decoder is able to decode shortly after the rates of transmission exceed the Slepian-Wolf bounds. The decoder then send an ACK back to the encoders, terminating transmissio...

The Redundancy of Slepian-Wolf Coding Revisited

[Draft] In this paper, the redundancy of Slepian Wolf coding is revisited. Applying the random binning and converse technique in [6], the same results in [5] are obtained with much simpler proofs. Moreover, our results reflect more details about the high-order terms of the coding rate. The redundancy is investigated for both fixed-rate and variable-rate cases. The normal approximation (or dispe...